翻訳と辞書 Words near each other ・ Hieronimo ・ Hieronimo Custodis ・ Hieronimo Miani ・ Hieronimo Squarciafico ・ Hieronimowo ・ Hieronimów ・ Hieronyma ・ Hieronyma clusioides ・ Hieronyma crassistipula ・ Hieronyma jamaicensis ・ Hieronyma macrocarpa ・ Hieronymiella ・ Hierarchical closeness ・ Hierarchical Cluster Engine Project ・ Hierarchical clustering ・ Hierarchical clustering of networks ・ Hierarchical constraint satisfaction ・ Hierarchical control system ・ Hierarchical Data Format ・ Hierarchical database model ・ Hierarchical decision process ・ Hierarchical Dirichlet process ・ Hierarchical Editing Language for Macromolecules ・ Hierarchical epistemology ・ Hierarchical fair-service curve ・ Hierarchical File System ・ Hierarchical generalized linear model ・ Hierarchical hidden Markov model ・ Hierarchical INTegration ・ Hierarchical internetworking model Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hierarchical clustering of networks ： ウィキペディア英語版 Hierarchical clustering of networks Hierarchical clustering is one method for finding community structures in a network. The technique arranges the network into a hierarchy of groups according to a specified weight function. The data can then be represented in a tree structure known as a dendrogram. Hierarchical clustering can either be agglomerative or divisive depending on whether one proceeds through the algorithm by adding links to or removing links from the network, respectively. One divisive technique is the Girvan–Newman algorithm. ==Algorithm== In the hierarchical clustering algorithm, a weight $W\_$ is first assigned to each pair of vertices $(i,j)$ in the network. The weight, which can vary depending on implementation (see section below), is intended to indicate how closely related the vertices are. Then, starting with all the nodes in the network disconnected, begin pairing nodes in order of decreasing weight between the pairs (in the divisive case, start from the original network and remove links in order of decreasing weight). As links are added, connected subsets begin to form. These represent the network's community structures. The components at each iterative step are always a subset of other structures. Hence, the subsets can be represented using a tree diagram, or dendrogram. Horizontal slices of the tree at a given level indicate the communities that exist above and below a value of the weight. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hierarchical clustering of networks」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.